A Survey on the Computational Power of Some Classes of Nite Monoid-presentations

نویسنده

  • Friedrich Otto
چکیده

An overview is given on the decidability results that have been obtained for the various classes of nite monoid-presentations that involve string-rewriting systems which are noetherian and (weakly) connuent. Further, the Knuth-Bendix completion procedure and some of its extensions are described. Finally, a current research project supported by the Deutsche Forschungsgemeinschaft (DFG) is presented that aims at the development of a software system XSSR that realizes the various decidability results presented in the paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniform Decision Problems for Certain Restricted Classes of Nite Monoid-presentations { a Survey on Recent Undecidability Results

It is well-known that many decision problems are undecidable in general for the class of all nite monoid-presentations. Here we consider the question of which of these problems remain undecidable even for very restricted classes of nite monoid-presentations. The restrictions we are interested in concern the number of generators admitted and the condition that each nite monoid-presentation consi...

متن کامل

Some Decision Problems Related To

The problem of deciding whether a monoid that is given through a nite presentation is a regular monoid as well as two closely related decision problems are considered. Since these problems are undecidable in general, they are investigated for certain restricted classes of nite presentations. Some new decidability results as well as some new undecidability results are obtained, which show that f...

متن کامل

On quasi-Armendariz skew monoid rings

Let $R$ be a unitary ring with an endomorphism $σ$ and $F∪{0}$ be the free monoid generated by $U={u_1,…,u_t}$ with $0$ added, and $M$ be a factor of $F$ setting certain monomial in $U$ to $0$, enough so that, for some natural number $n$, $M^n=0$. In this paper, we give a sufficient condition for a ring $R$ such that the skew monoid ring $R*M$ is quasi-Armendariz (By Hirano a ring $R$ is called...

متن کامل

Catalan Monoids, Monoids of Local Endomorphisms, and Their Presentations

The Catalan monoid and partial Catalan monoid of a directed graph are introduced. Also introduced is the notion of a local endomorphism of a tree, and it is shown that the Catalan (resp. partial Catalan) monoid of a tree is simply its monoid of extensive local endomorphisms (resp. partial endomorphisms) of nite shift. The main results of this paper are presentations for the Cata-lan and partial...

متن کامل

The Finiteness of Finitely Presented Monoids

Introduction. It is undecidable whether a monoid given by a nite presentation is nite (see, e.g., [1], pp. 157{160). On the other hand, with the mere knowledge that the monoid is nite, one can e ectively construct the multiplication table of the monoid, and thus obtain a complete understanding of its structure. This paper will present this construction method in detail (Section 2) and o er some...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998